On Refutation Rules

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Learning versus Refutation

Building on the work of Daniely et al. (STOC 2014, COLT 2016), we study the connection between computationally efficient PAC learning and refutation of constraint satisfaction problems. Specifically, we prove that for every concept class P, PAC-learning P is polynomially equivalent to “random-right-hand-side-refuting” (“RRHS-refuting”) a dual class P∗, where RRHS-refutation of a class Q refers ...

متن کامل

On Learning vs. Refutation

Building on the work of Daniely et al. (STOC 2014, COLT 2016), we study the connection between computationally efficient PAC learning and refutation of constraint satisfaction problems. Specifically, we prove that for every concept class P, PAC-learning P is polynomially equivalent to “random-right-hand-side-refuting” (“RRHS-refuting”) a dual class P∗, where RRHS-refutation of a class Q refers ...

متن کامل

On Refutation of Random Constraint Satisfaction Problems

Given a k-ary predicate P , a random instance of a constraint satisfaction problem (CSP) is a set of m constraints on n variables. Each constraint is P applied to k random literals. Such an instance is unsatisfiable with high probability when m n. Although this fact can be proven via a simple probabilistic argument, certifying that a given randomly chosen instance is unsatisfiable, a task calle...

متن کامل

On Graph Refutation for Relational Inclusions

We introduce a sound and complete goal-oriented graph calculus for relational inclusions.1 Though somewhat richer, it is conceptually simpler and easier to use than the usual ones, as is its extension for handling hypotheses, due to goal-orientation. Diagrams and figures are very important and useful in several branches of science, as well as in everyday life. Graphs and diagrams provide conven...

متن کامل

On Narrowing, Refutation Proofs and Constraints

We develop a proof technique for dealing with narrowing and refutational theorem proving in a uniform way, clarifying the exact relationship between the existing results in both elds and allowing us to obtain several new results. Reenements of narrowing (basic, LSE, etc.) are instances of the technique, but are also deened here for arbitrary (possibly ordering and/or equality constrained or not...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Logica Universalis

سال: 2011

ISSN: 1661-8297,1661-8300

DOI: 10.1007/s11787-011-0035-4